arithmetic of primes


arithmetic of primes
, prime products, Galois fields арифметики простых чисел, произведений простых чисел, полей Галуа.

English-Russian cryptological dictionary . 2014.

Смотреть что такое "arithmetic of primes" в других словарях:

  • Primes in arithmetic progression — In number theory, the phrase primes in arithmetic progression refers to at least three prime numbers that are consecutive terms in an arithmetic progression, for example the primes (3, 7, 11) (it does not matter that 5 is also prime). There are… …   Wikipedia

  • Arithmetic function — In number theory, an arithmetic (or arithmetical) function is a real or complex valued function ƒ(n) defined on the set of natural numbers (i.e. positive integers) that expresses some arithmetical property of n. [1] An example of an arithmetic… …   Wikipedia

  • Arithmetic derivative — In number theory, the arithmetic derivative, or number derivative, is a function defined for integers, based on prime factorization, by analogy with the product rule for the derivative of a function that is used in mathematical analysis. Contents …   Wikipedia

  • Arithmetic of abelian varieties — In mathematics, the arithmetic of abelian varieties is the study of the number theory of an abelian variety, or family of those. It goes back to the studies of Fermat on what are now recognised as elliptic curves; and has become a very… …   Wikipedia

  • arithmetic — arithmetically, adv. n. /euh rith meuh tik/; adj. /ar ith met ik/, n. 1. the method or process of computation with figures: the most elementary branch of mathematics. 2. Also called higher arithmetic, theoretical arithmetic. the theory of… …   Universalium

  • Arithmetic progression — In mathematics, an arithmetic progression or arithmetic sequence is a sequence of numbers such that the difference of any two successive members of the sequence is a constant. For instance, the sequence 3, 5, 7, 9, 11, 13... is an arithmetic… …   Wikipedia

  • arithmetic function —       any mathematical function defined for integers (…, −3, −2, −1, 0, 1, 2, 3, …) and dependent upon those properties of the integer itself as a number, in contrast to functions that are defined for other values (real numbers (real number),… …   Universalium

  • Arithmetic complexity of the discrete Fourier transform — See Fast Fourier transform#Bounds on complexity and operation counts for a general summary of this issue.Bounds on the multiplicative complexity of FFTIn his PhD thesis in 1987 [1] , Michael Heidman focus on the arithmetic theory of complexity… …   Wikipedia

  • Dirichlet's theorem on arithmetic progressions — In number theory, Dirichlet s theorem, also called the Dirichlet prime number theorem, states that for any two positive coprime integers a and d, there are infinitely many primes of the form a + nd, where n ≥ 0. In other… …   Wikipedia

  • Problems involving arithmetic progressions — are of interest in number theory,cite journal|author=Samuel S. Wagstaff, Jr.|authorlink= url= title=Some Questions About Arithmetic Progressions journal=The American Mathematical Monthly volume=86|issue=7|pages=579–582|year=1979… …   Wikipedia

  • Fundamental theorem of arithmetic — In number theory, the fundamental theorem of arithmetic (or unique prime factorization theorem) states that every natural number greater than 1 can be written as a unique product of prime numbers. For instance, : 6936 = 2^3 imes 3 imes 17^2 , ,! …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.